Parameterized verification of leader/follower systems via first-order temporal logic

Abstract We introduce a framework for the verification of protocols involving distinguished machine (referred to as leader) orchestrating operation an arbitrary number identical machines followers) in network. At core our is high-level formalism capturing these types together with their network interactions. show that this automatically translates tractable form first-order temporal logic. Checking whether protocol specified satisfies desired property (expressible logic) then amounts checking protocol’s translation logic entails property. Many different used practice, such cache coherence, atomic commitment, consensus, and synchronization protocols, fit within framework. First-order also facilitates parameterized by enabling us model abstractly without referring individual machines.